Optimization at All Launching Times
نویسندگان
چکیده
In the DE-STAR lab, we propose to use phased laser array with photon propellant in order to achieve significantly higher speed for the spacecraft. During the simulation, the laser is sometimes turned off to avoid cancellation of force or acceleration. However, if we shut off the laser accurately, the duration rises and drops even when the launch time is altered slightly, which makes the real implementation difficult. In this paper, we optimize the algorithm, modifying the craft’s orbit to maximize the propelling force. As a result, we stabilize the chaotic outcomes and minimize the time of transit for the craft to reach a target in space.
منابع مشابه
The Development of a Parallel Ray Launching Algorithm for Wireless Network Planning
Propagation modeling has attracted much interest because it plays an important role in wireless network planning and optimization. Deterministic approaches such as ray tracing and ray launching have been investigated, however, due to the running time constraint, these approaches are still not widely used. In previous work, an intelligent ray launching algorithm, namely IRLA, has been proposed. ...
متن کاملA Three-dimensional Matching Model for Perishable Production Scheduling
In the production of perishable goods particular stress is often given to performance indi cators generally less critical in such manufacturing settings as metal cutting or mechan ical electronic assembly For instance in food or biochemical productions a prominent interest of the producer is to reduce the time from distribution to the so called best before end A scheduling problem with a goal o...
متن کاملExact formulations and algorithm for the train timetabling problem with dynamic demand
In this paper we study the design and optimization of train timetabling adapted to a dynamic demand environment. This problem arises in rapid train services which are common in most important cities. We present four formulations for the problem, with the aim of minimizing passenger average waiting time. The first one consists of a mixed integer non-linear programming model in which binary varia...
متن کاملReducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
The Mesh Adaptive Direct Search (MADS) class of algorithms is designed for nonsmooth optimization, where the objective function and constraints are typically computed by launching a time-consuming computer simulation. Each iteration of a MADS algorithm attempts to improve the current best-known solution by launching the simulation at a finite number of trial points. Common implementations of MA...
متن کاملIntelligent Ray Launching Algorithm for Indoor Scenarios
This article describes the indoor IRLA (Intelligent Ray Launching Algorithm), which originates from an efficient outdoor propagation prediction model. Implementation and validation are given in detail. An indoor office scenario is selected and simulations via the IRLA model and two other reference models have been performed. Predictions are analyzed and recommendations are given. Results show t...
متن کامل